A NOTE ON BARE-NP ADVERBS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Representing Adjectives and Adverbs

Representing Engl ish ad jec t i ves and adverbs using a l o g i c a l l y perspicuous no ta t ion (extended semantic networks, Schubert. 1974) and the i r accomodation w i t h i n a state-based paradigm (Cercone, 1975) are discussed. Where appropr ia te , e x p l i c i t comparisons are made w i th re la ted approaches such as those of Schank (1972.197*0, Montague (1972), Bartsch and Venneraan...

متن کامل

A Note on NP ∩ coNP / poly

In this note we show that AMexp 6⊆ NP ∩ coNP/poly, where AMexp denotes the exponential version of the class AM. The main part of the proof is a collapse of EXP to AM under the assumption that EXP ⊆ NP ∩ coNP/poly

متن کامل

Norwegian Bare Singulars: a Note on Types and Sorts

The distribution of bare singulars in Norwegian was thoroughly examined in Borthen (2003). The present paper outlines an account of these data in a type-logical semantics of the Neo-Carlsonian kind. The focus is primarily on the syntax-semantics interface, which here, somewhat simplified, amounts to assigning semantic types in the appropriate sortal domain to bare singulars. I argue that bare s...

متن کامل

A note on I-completeness of NP-witnessing relations

In this note, we study under which conditions various sets (even easy ones) can be associated with a witnessing relation that is #P complete. We show a sufficient condition for an NP set to have such a relation. This condition applies also to many NP-complete sets, as well as to many sets in P .

متن کامل

A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP

We study two properties of a complexity class C—whether there exists a truthtable hard p-selective language for C , and whether polynomially-many nonadaptive queries to C can be answered by making O(logn)-many adaptive queries to C (in symbols, is PF tt PF [O(logn)]). We show that if there exists a NP-hard p-selective set under truth-table reductions, then PFNP tt PFNP[O(logn)]. As a consequenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ENGLISH LINGUISTICS

سال: 1987

ISSN: 0918-3701,1884-3107

DOI: 10.9793/elsj1984.4.336